Browsing by Subject "Distributed systems"
Now showing items 1-20 of 30
-
Conference Object
An architecture for highly available and dynamically upgradeable Web services
(2007)Developing distributed application architectures characterized by high availability has always been a challenging and important task both for the academic and the industrial communities. Additionally, the related requirement ...
-
Conference Object
Brief announcement: On the robustness of (semi)fast quorum-based implementations of atomic shared memory
(2008)Atomic (linearizable) read/write memory is a fundamental abstractions in distributed computing. Following a seminal implementation of atomic memory of Attiya et al.[6], a folklore belief developed that in messaging-passing ...
-
Article
Cloud computing: Distributed internet computing for IT and scientific research
(2009)Cloud computing is location agnostic and provides dynamically scalable and virtualized resources as services over the Internet. Here, the authors provide broad introductory definitions to cloud computing concepts. Articles ...
-
Article
The complexity of synchronous iterative do-all with crashes
(2001)Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [8]. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have ...
-
Conference Object
Decentralized failure diagnosis in discrete event systems
(2006)In this paper, we develop and analyze decentralized failure diagnosis schemes for systems that can be modeled as finite state machines (FSMs). We consider a scenario where we are given multiple local diagnosers (with partial ...
-
Article
Developing a consistent domain-oriented distributed object service
(2009)This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. This service is ...
-
Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
-
Article
Distributed cycle detection and removal
(2018)In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
-
Article
Distributed finite-time average-consensus with limited computational and storage capability
(2017)Consensus is a fundamental feature of distributed systems, and it is the prerequisite for several complex tasks, such as flocking of mobile robots, localization in wireless-sensor networks, or decentralized control of smart ...
-
Conference Object
Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems
(2013)We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
-
Conference Object
Distributed minimum-time weight balancing over digraphs
(IEEE Computer Society, 2014)We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
-
Article
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
(2016)We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed stopping in average consensus via event-triggered strategies
(IEEE Computer Society, 2013)We develop and analyze a distributed event-triggered linear iterative algorithm that enables the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed strategies for average consensus in directed graphs
(2011)We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...
-
Conference Object
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
-
Conference Object
Finite-time distributed consensus in graphs with time-invariant topologies
(2007)We present a method for achieving consensus in distributed systems in a finite number of time-steps. Our scheme involves a linear iteration where, at each time-step, each node updates its value to be a weighted average of ...
-
Conference Object
Implementing interaction nets in MONSTR
(Association for Computing Machinery, 1997)Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from multiplicative Linear Logic and feature undirected graph edges, while MONSTR arose from the desire ...
-
Article
Long-lived Rambo: Trading knowledge for communication
(2004)Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...
-
Article
Modelling control systems in an event-driven coordination language
(2000)The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures for complex control systems using a ...
-
Conference Object
Optimal Topology for Distributed Fault Detection of Large-scale Systems★★This paper has been partially supported by the EPSRC STABLENET grant EP/L014343/1.
(2015)The paper deals with the problem of defining the optimal topology for a distributed fault detection architecture for non-linear large-scale systems. A stochastic modelbased framework for diagnosis is formulated. The system ...